Definability and Transformations for Cost Logics and Automatic Structures
نویسندگان
چکیده
We provide new characterizations of the class of regular cost functions (Colcombet 2009) in terms of first-order logic. This extends a classical result stating that each regular language can be defined by a first-order formula over the infinite tree of finite words with a predicate testing words for equal length. Furthermore, we study interpretations for cost logics and use them to provide different characterizations of the class of resource automatic structures, a quantitative version of automatic structures. In particular, we identify a complete resource automatic structure for first-order interpretations.
منابع مشابه
Truth Values and Connectives in Some Non-Classical Logics
The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...
متن کاملModal Definability Based on Łukasiewicz Validity Relations
We study two notions of definability for classes of relational structures based on modal extensions of Łukasiewicz finitely-valued logics. The main results of the paper are the equivalent of the Goldblatt Thomason theorem for these notions of definability.
متن کاملInterpolation Properties, Beth Definability Properties and Amalgamation Properties for Substructural Logics
This paper develops a comprehensive study of various types of interpolation properties and Beth definability properties for substructural logics, and their algebraic characterizations through amalgamation properties and epimorphisms surjectivity. In general, substructural logics are algebraizable but lack many of the basic logical properties that modal and superintuitionistic logics enjoy (cf. ...
متن کاملAutomatic Structures
We study definability and complexity issues for automatic and ω-automatic structures. These are, in general, infinite structures but they can be finitely presented by a collection of automata. Moreover, they admit effective (in fact automatic) evaluation of all first-order queries. Therefore, automatic structures provide an interesting framework for extending many algorithmic and logical method...
متن کاملThe Theorems of Beth and Craig in Abstract Model Theory,iii: ∆-logics and Infinitary Logics Sh113
We give a general technique on how to produce counterexamples to Beth’s definability (and weak definability) theorem. The method is then applied for various infinitary, cardinality quantifier logics and ∆-closure of such logics. I would like to thank Alice Leonhardt for the beautiful typing. AMS-Classification: 03C95, 03C20, 03E55, 03C55, 03C30. The author would like to thank the United States ...
متن کامل